Rewriting systems in sufficiently large Artin–Tits groups
نویسندگان
چکیده
منابع مشابه
Rewriting Systems for Coxeter Groups
A finite complete rewriting system for a group is a finite presentation which gives a solution to the word problem and a regular language of normal forms for the group. In this paper it is shown that the fundamental group of an orientable closed surface of genus g has a finite complete rewriting system, using the usual generators a1, .., ag, b1, .., bg along with generators representing their i...
متن کاملArtin groups, rewriting systems and three-manifolds
We construct finite complete rewriting systems for two large classes of Artin groups: those of finite type, and those whose defining graphs are based on trees. The constructions in the two cases are quite different; while the construction for Artin groups of finite type uses normal forms introduced through work on complex hyperplane arrangements, the rewriting systems for Artin groups based on ...
متن کاملRewriting Systems in Alternating Knot Groups with the Dehn Presentation
Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the Dehn presentation of the knot group of a tame, prime, alternating knot, with a regular and common projection has a finite and complete rewriting system. Although there are rules in the rewriting system with lefthand side a gener...
متن کاملRewriting Systems and Embedding of Monoids in Groups
In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system R that satisfies the condition that each rule in R with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from R embeds in the group. As an example, ...
متن کاملMaximum Hitting for n Sufficiently Large
For a left-compressed intersecting family A ⊆ [n] and a set X ⊆ [n], let A(X) = {A ∈ A : A ∩ X 6= ∅}. Borg asked: for which X is |A(X)| maximised by taking A to be all r-sets containing the element 1? We determine exactly which X have this property, for n sufficiently large depending on r.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2016
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.07.031